Two Competing Discrete-Time Queues with Priority
نویسنده
چکیده
منابع مشابه
MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملA New Form of Efficient Tree-based Priority Queues for Discrete Event Simulation
A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical ti...
متن کاملDiscrete-time Priority Queues with Two-state Markov Modulated Arrivals
A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...
متن کاملDelay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high ...
متن کاملMultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branchand-bound. However, a classical priority queue constitutes a severe bottleneck in this context, leading to very small throughput. Hence, there has been significant interest in concurrent priority queues with a somewhat relaxed semantics w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 3 شماره
صفحات -
تاریخ انتشار 1988